Polytopes and arrangements : Diameter and curvatureDEZA, Antoine; TERLAKY, Tamas; ZINCHENKO, Yuriy et al.Operations research letters. 2008, Vol 36, Num 2, pp 215-222, issn 0167-6377, 8 p.Article

A new smoothing Newton-type method for second-order cone programming problemsLIANG FANG; GUOPING HE; YUNHONG HU et al.Applied mathematics and computation. 2009, Vol 215, Num 3, pp 1020-1029, issn 0096-3003, 10 p.Article

On well definedness of the central pathGRANA DRUMMOND, L. M; SVAITER, B. F.Journal of optimization theory and applications. 1999, Vol 102, Num 2, pp 223-237, issn 0022-3239Article

Algorithms for central-median paths with bounded length on trees : Advances in location analysisBECKER, Ronald I; LARI, Isabella; SCOZZARI, Andrea et al.European journal of operational research. 2007, Vol 179, Num 3, pp 1208-1220, issn 0377-2217, 13 p.Article

Asymptotic behavior of the central path for a special class of degenerate SDP problemsDA CRUZ NETO, Joao X; FERREIRA, Orizon P; MONTEIRO, Renato D. C et al.Mathematical programming. 2005, Vol 103, Num 3, pp 487-514, issn 0025-5610, 28 p.Article

Long-step homogeneous interior-point algorithm for the P_* -nonlinear complementarity problemsLESAJA, Goran.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 17-48, issn 0354-0243, 32 p.Article

Existence of interior points and interior paths in nonlinear monotone complementarity problemsGÜLER, O.Mathematics of operations research. 1993, Vol 18, Num 1, pp 128-147, issn 0364-765XArticle

Initialization in semidefinite programming via a self-dual skew-symmetric embeddingDE KLERK, E; ROOS, C; TERLAKY, T et al.Operations research letters. 1997, Vol 20, Num 5, pp 213-221, issn 0167-6377Article

Interior proximal methods and central paths for convex second-order cone programmingSHAOHUA PAN; CHEN, Jein-Shan.Nonlinear analysis. 2010, Vol 73, Num 9, pp 3083-3100, issn 0362-546X, 18 p.Article

A note on the use of vector barrier parameters for interior-point methodsMOGUERZA, Javier M; OLIVARES, Alberto; PRIETO, Francisco J et al.European journal of operational research. 2007, Vol 181, Num 2, pp 571-585, issn 0377-2217, 15 p.Article

Examples of ill-behaved central paths in convex optimizationGILBERT, J. Charles; GONZAGA, Covis C; KARAS, Elizabeth et al.Mathematical programming. 2005, Vol 103, Num 1, pp 63-94, issn 0025-5610, 32 p.Article

A redundant Klee-Minty construction with all the redundant constraints touching the feasible regionNEMATOLLAHI, Eissa; TERLAKY, Tamas.Operations research letters. 2008, Vol 36, Num 4, pp 414-418, issn 0167-6377, 5 p.Article

Central Paths in Semidefinite Programming, Generalized Proximal-Point Method and Cauchy Trajectories in Riemannian ManifoldsDA CRUZ NETO, J. X; FERREIRA, O. P; OLIVEIRA, P. R et al.Journal of optimization theory and applications. 2008, Vol 139, Num 2, pp 227-242, issn 0022-3239, 16 p.Article

An interior point method in Dantzig-Wolfe decompositionMARTINSON, R. K; TIND, J.Computers & operations research. 1999, Vol 26, Num 12, pp 1195-1216, issn 0305-0548Article

A full-Newton step interior-point algorithm based on modified Newton directionLIPU ZHANG; YINGHONG XU.Operations research letters. 2011, Vol 39, Num 5, pp 318-322, issn 0167-6377, 5 p.Article

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithmsMONTEIRO, Renato D. C; TSUCHIYA, Takashi.Mathematical programming. 2008, Vol 115, Num 1, pp 105-149, issn 0025-5610, 45 p.Article

A sublinear parallel algorithm for stable matchingFEDER, T; MEGIDDO, N; PLOTKIN, S. A et al.Theoretical computer science. 2000, Vol 233, Num 1-2, pp 297-308, issn 0304-3975Article

Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution existsSTURM, J. F.Mathematics of operations research. 1999, Vol 24, Num 1, pp 72-94, issn 0364-765XArticle

On central-path proximity measures in interior-point methodsGONZALEZ-LIMA, M. D; ROOS, C.Journal of optimization theory and applications. 2005, Vol 127, Num 2, pp 303-328, issn 0022-3239, 26 p.Article

Invariance and efficiency of convex representationsCHEK BENG CHUA; TUNNEL, Levent.Mathematical programming. 2008, Vol 111, Num 1-2, pp 113-140, issn 0025-5610, 28 p.Conference Paper

On some properties and an application of the logarithmic barrier methodBURACHIK, Regina S; GRANA DRUMMOND, L. M; SCHEIMBERG, Susana et al.Mathematical programming. 2008, Vol 111, Num 1-2, pp 95-112, issn 0025-5610, 18 p.Conference Paper

On a special class of regularized central paths for semidefinite programsANHUA LIN.Mathematical programming (Print). 2010, Vol 122, Num 1, pp 65-85, issn 0025-5610, 21 p.Article

Existence, uniqueness, and convergence of the regularized primal-dual central pathCASTRO, Jordi; CUESTA, Jordi.Operations research letters. 2010, Vol 38, Num 5, pp 366-371, issn 0167-6377, 6 p.Article

On the Analyticity of Underlying HKM Paths for Monotone Semidefinite Linear Complementarity ProblemsSIM, C. K.Journal of optimization theory and applications. 2009, Vol 141, Num 1, pp 193-215, issn 0022-3239, 23 p.Article

A new barrier for a class of semidefinite problemsPAPA QUIROZ, Erik A; ROBERTO OLIVEIRA, Paolo.RAIRO. Recherche opérationnelle. 2006, Vol 40, Num 3, pp 303-323, issn 0399-0559, 21 p.Article